Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search
نویسندگان
چکیده
منابع مشابه
Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search
Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard constraints such as classroom, class curriculum, and other variables. Concurrently, some soft constraints need also to be considered, including teacher...
متن کاملSolving effectively the school timetabling problem using particle swarm optimization
New results are listed below, derived from the algorithm presented at the corresponding paper, due to a minor significance bug correction and further experiments conducted after the publication date of the paper. The new results may differ from those mentioned at the text of the original paper. Nevertheless, the new results are, in the great majority, at least as good as the previous ones conce...
متن کاملParticle Swarm Optimization with Transition Probability for Timetabling Problems
In this paper, we propose a new algorithm to solve university course timetabling problems using a Particle Swarm Optimization (PSO). PSOs are being increasingly applied to obtain near-optimal solutions to many numerical optimization problems. However, it is also being increasingly realized that PSOs do not solve constraint satisfaction problems as well as other meta-heuristics do. In this paper...
متن کاملSolving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization
This paper presents a Particle Swarm Optimization (PSO) algorithm for constrained nonlinear optimization problems. In PSO, the potential solutions, called particles, are "flown" through the problem space by learning from the current optimal particle and its own memory. In this paper, preserving feasibility strategy is employed to deal with constraints. PSO is started with a group of feasible so...
متن کاملHybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems
In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2013
ISSN: 1999-4893
DOI: 10.3390/a6020227